Multi-agent compositional stability exploiting system symmetries
نویسندگان
چکیده
منابع مشابه
Multi-agent compositional stability exploiting system symmetries
This paper considers nonlinear symmetric control systems. By exploiting the symmetric structure of the system, stability results are derived that are independent of the number of components in the system. This work contributes to the fields of research directed toward compositionality and composability of large-scale system in that a system can be “built-up” by adding components while maintaini...
متن کاملPrinciples of Compositional Multi-Agent System Development
A dedicated development method for multi-agent systems requires adequate means to describe the characteristics of agents and multi-agent systems. Compositional multi-agent system development is based on the principles process and knowledge abstraction, compositionality, reuse, specification and verification. Although the paper addreses these principles of compositional multi-agent system develo...
متن کاملSpecification of Behavioural Requirements within Compositional Multi-Agent System Design
In this paper it is shown how informal and formal specification of behavioural requirements and scenarios for agents and multi-agent systems can be integrated within multi-agent system design. In particular, i t is addressed how a compositional perspective both on design descriptions and specification of behavioural requirements can be exploited. The approach has been applied in a case study: t...
متن کاملSpecification of Bahavioural Requirements within Compositional Multi-agent System Design
In this paper it is shown how informal and formal specification of behavioural requirements and scenarios for agents and multi-agent systems can be integrated within multi-agent system design. In particular, i t is addressed how a compositional perspective both on design descriptions and specification of behavioural requirements can be exploited. The approach has been applied in a case study: t...
متن کاملExploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains
While Partially Observable Markov Decision Processes (POMDPs) and their multiagent extension Partially Observable Stochastic Games (POSGs) provide a natural and systematic approach to modeling sequential decision making problems under uncertainty, the computational complexity with which the solutions are computed is known to be prohibitively expensive. In this paper, we show how such high compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2013
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2013.07.003